Beyond sparsity: Universally stable compressed sensing when the number of 'free' values is less than the number of observations
نویسنده
چکیده
Recent results in compressed sensing have shown that a wide variety of structured signals can be recovered from undersampled and noisy linear observations. In this paper, we show that many of these signal structures can be modeled using an union of affine subspaces, and that the fundamental number of observations needed for stable recovery is given by the number of “free” values, i.e. the dimension of the largest subspace in the union. One surprising consequence of our results is that the fundamental phase transition for random discrete–continuous signal models can be attained by a universal estimator that does not depend on the distribution.
منابع مشابه
A Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملAccelerating Magnetic Resonance Imaging through Compressed Sensing Theory in the Direction space-k
Magnetic Resonance Imaging (MRI) is a noninvasive imaging method widely used in medical diagnosis. Data in MRI are obtained line-by-line within the K-space, where there are usually a great number of such lines. For this reason, magnetic resonance imaging is slow. MRI can be accelerated through several methods such as parallel imaging and compressed sensing, where a fraction of the K-space lines...
متن کاملUniversally Elevating the Phase Transition Performance of Compressed Sensing: Non-Isometric Matrices are Not Necessarily Bad Matrices
In compressed sensing problems, l1 minimization or Basis Pursuit was known to have the best provable phase transition performance of recoverable sparsity among polynomialtime algorithms. It is of great theoretical and practical interest to find alternative polynomial-time algorithms which perform better than l1 minimization. [20], [21], [22] and [23] have shown that a two-stage re-weighted l1 m...
متن کاملMathematical Model of Novel COVID-19 and Its Transmission Dynamics
In this paper, we formulated a dynamical model of COVID-19 to describe the transmission dynamics of the disease. The well possedness of the formulated model equations was proved. Both local and global stability of the disease free equilibrium and endemic equilibrium point of the model equation was established using basic reproduction number. The results show that, if the basic reproduction numb...
متن کاملStochastically Estimating Modular Criticality in Large-Scale Logic Circuits Using Sparsity Regularization and Compressive Sensing
This paper considers the problem of how to efficiently measure a large and complex information field with optimally few observations. Specifically, we investigate how to stochastically estimate modular criticality values in a large-scale digital circuit with a very limited number of measurements in order to minimize the total measurement efforts and time. We prove that, through sparsity-promoti...
متن کامل